Optimal policies for constrained average-cost Markov decision processes
نویسندگان
چکیده
منابع مشابه
Constrained Markov Decision Process and Optimal Policies
In the course lectures, we have discussed a lot regarding unconstrained Markov Decision Process (MDP). The dynamic programming decomposition and optimal policies with MDP are also given. However, in this report we are going to discuss a different MDP model, which is constrained MDP. There are many realistic demand of studying constrained MDP. For instance, in the wireless sensors networks, each...
متن کاملl AVERAGE COST SEMI - MARKOV DECISION PROCESSES
^ The Semi-Markov Decision model is considered under the criterion of long-run average cost. A new criterion, which for any policy considers the limit of the expected cost Incurred during the first n transitions divided by the expected length of the first n transitions, is considered. Conditions guaranteeing that an optimal stationary (nonrandomized) policy exist are then presented. It is also ...
متن کاملNon-randomized policies for constrained Markov decision processes
This paper addresses constrained Markov decision processes, with expected discounted total cost criteria, which are controlled by nonrandomized policies. A dynamic programming approach is used to construct optimal policies. The convergence of the series of finite horizon value functions to the infinite horizon value function is also shown. A simple example illustrating an application is presented.
متن کاملOptimality Inequalities for Average Cost Markov Decision Processes and the Optimality of (s, S) Policies
For general state and action space Markov decision processes, we present sufficient conditions for convergence of both the optimal discounted cost value function and policies to the corresponding objects for the average costs per unit time. We extend Schäl’s [24] assumptions, guaranteeing the existence of a solution to the average cost optimality inequalities for compact action sets, to non-com...
متن کاملSimulation-Based Algorithms for Average Cost Markov Decision Processes
In this paper, we give a summary of recent development of simulation-based algorithms for average cost MDP problems, which are different from those for discounted cost problems or shortest path problems. We introduce both simulation-based policy iteration algorithms and simulation-based value iteration algorithms for average cost problem, and give the pros and cons of each algorithm.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: TOP
سال: 2009
ISSN: 1134-5764,1863-8279
DOI: 10.1007/s11750-009-0110-7